Fast-Collapsing Theories

نویسنده

  • Samuel A. Alexander
چکیده

Reinhardt’s conjecture, a formalization of the statement that a truthful knowing machine can know its own truthfulness and mechanicalness, was proved by Carlson using sophisticated structural results about the ordinals and transfinite induction just beyond the first epsilon number. We prove a weaker version of the conjecture, by elementary methods and transfinite induction up to a smaller ordinal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First observation of two-stage collapsing kinetics of a single synthetic polymer chain.

Using a narrowly distributed poly(N-isoporpylacrylamide) (PNIPAM) chain with a degree of polymerization (N) of 3100, randomly labeled with pyrene, we have, for the first time, observed the two-stage kinetics of the coil-to-globule transition. Two characteristic relaxation times, tau(fast) for the crumpling of a random coil (approximately 12 ms) and tau(slow) for the collapsing of the crumpled c...

متن کامل

Operator Weak Values and Black Hole Complementarity ⋆

In conventional field theories, the emission of Hawking radiation in the background of a collapsing star requires transplanckian energy fluctuations. These

متن کامل

Complete Strategies for Term Graph Narrowing

Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are often implemented on graph-like data structures to exploit sharing of common subexpressions. In this paper, we study the completeness of narrowing in graph-based implementations. We show that the well-known condition for the comple...

متن کامل

Fault Collapsing in Digital Circuits Using Fast Fault Dominance and Equivalence Analysis with SSBDDs

The paper presents a new method and an algorithm for structural fault collapsing to reduce the search space for test generation, to speed up fault simulation and to make the fault diagnosis easier in digital circuits. The proposed method is based on hierarchical topology analysis of the circuit description at two levels. First, the gate-level circuit will be converted into a macro-level network...

متن کامل

Post choice information integration as a causal determinant of confidence: Novel data and a computational account.

Confidence judgments are pivotal in the performance of daily tasks and in many domains of scientific research including the behavioral sciences, psychology and neuroscience. Positive resolution i.e., the positive correlation between choice-correctness and choice-confidence is a critical property of confidence judgments, which justifies their ubiquity. In the current paper, we study the mechanis...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2015